Eecient Parallel Solving the Potential Flow Problems on Nonmatching Grids
نویسندگان
چکیده
We consider a parallel application of DD algorithm proposed in 8] to approximate solving the fully potential subsonic ow problem on nonmatching grids. A short description of the method and results of numerical experiments on parallel computers SP2 and Paragon are presented.
منابع مشابه
Mixed Finite Element Methods on Nonmatching Multiblock Grids
We consider mixed nite element methods for second order elliptic equations on non-matching multiblock grids. A mortar nite element space is introduced on the non-matching interfaces. We approximate in this mortar space the trace of the solution, and we impose weakly a continuity of ux condition. A standard mixed nite element method is used within the blocks. Optimal order convergence is shown f...
متن کاملMaximum norm error analysis of a nonmatching grids finite element method for linear elliptic PDEs
Keywords: Elliptic PDEs Schwarz alternating method Nonmatching grids Finite element L 1 – error estimate a b s t r a c t In this paper, we study a nonmatching grid finite element approximation of linear elliptic PDEs in the context of the Schwarz alternating domain decomposition.We show that the approximation converges optimally in the maximum norm, on each subdomain, making use of the geometri...
متن کاملPreconditioners for the dual-primal FETI methods on nonmatching grids: Numerical study
FETI-DP method is a substructuring method that uses Lagrange multipliers to match the continuity condition on the subdomain boundaries. For the FETI-DP method on nonmatching grids, two different formulations are known with respect to how to employ the mortar matching condition. Keeping step with the developments of the FETI-DP methods, a variety of preconditioners for the FETI-DP operator have ...
متن کاملGeneralized Neumann-neumann Preconditioners for Iterative Substructuring
One of the primary objective of domain decomposition methods is the eecient solution on parallel machines of problems in Computational Mechanics set on complex ge-ometries and approximated on very ne grids. In iterative substructuring, this objective is achieved by splitting the original domain of computation in smaller nonoverlapping simpler subdomains, and by reducing the initial problem to a...
متن کاملImproved teaching–learning-based and JAYA optimization algorithms for solving flexible flow shop scheduling problems
Flexible flow shop (or a hybrid flow shop) scheduling problem is an extension of classical flow shop scheduling problem. In a simple flow shop configuration, a job having ‘g’ operations is performed on ‘g’ operation centres (stages) with each stage having only one machine. If any stage contains more than one machine for providing alternate processing facility, then the problem...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007